Joint induction of shape features and tree classifiers
نویسندگان
چکیده
منابع مشابه
Joint Induction of Shape Features and Tree Classifiers
We introduce a very large family of binary features for twodimensional shapes. The salient ones for separating particular shapes are determined by inductive learning during the construction of classification trees. There is a feature for every possible geometric arrangement of local topographic codes. The arrangements express coarse constraints on relative angles and distances among the code lo...
متن کاملJoint Induction of Shape Features and Tree Classiiers
We introduce a very large family of binary features for two-dimensional shapes. The salient ones for separating particular shapes are determined by inductive learning during the construction of classiication trees. There is a feature for every possible geometric arrangement of local topographic codes. The arrangements express coarse constraints on relative angles and distances among the code lo...
متن کاملShape Classification with Statistical Classifiers using Morphological Shape Representation Features
This paper compares the performance of four statistical classifiers, namely linear discriminant classifier, quadratic discriminant classifier, k-Nearest Neighborhood classifier, and parzen classifier are considered for recognition of 2D-shapes. The two features from morphological skeletons and four features from morphological shape decomposition are identified from 2D-shapes. These features are...
متن کاملJoint use of dynamical classifiers and ambiguity plane features
This paper argues for using ambiguity plane features within dynamic statistical models for classification problems. The relative contribution of the two model components are investigated in the context of acoustically monitoring cutter wear during milling of titanium, an application where it is known that standard static classification techniques work poorly. Experiments show that explicit mode...
متن کاملIntegrating Feature Construction with Multiple Classifiers in Decision Tree Induction
Feature construction can be attained by conducting a search for the best logical feature combination at every node of a decision tree. The exponential size of this search space, however, causes an instability: adding or removing few examples on each node subset tends to produce diierent best-feature combinations. We propose an approach to stabilize the feature construction mechanism by applying...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 1997
ISSN: 0162-8828
DOI: 10.1109/34.632990